A Constructive Solution of the Language Inequation XA ⊆ BX
نویسنده
چکیده
We consider the inequation XA ⊆ BX where A, B and X are formal languages, X is unknown. It has been proved in [9] that if B is a regular language then the maximal solution is also regular. However, the proof, based on Kruskal’s Tree Theorem, does not give any effective construction of the solution. Here we give such an effective construction in the case where A and B are both finite and are such that maxb∈B |b| < mina∈A |a|. Moreover, the complexity of our construction is elementary.
منابع مشابه
On effective construction of the greatest solution of language inequality XA ⊆ BX
In this paper, we consider effective constructions of the greatest solution of the language inequality XA ⊆ BX . It has been proved by Kunc in 2005 that the greatest solution of XA ⊆ BX is regular provided that B is regular, no matter what A is. However this proof is based on Kruskal’s tree theorem, and does not provide any effective way to construct the greatest solution. We focus on this gap ...
متن کاملOn the Equivalence of the Operator Equations XA + BX = C and X - p(-B)Xp(A)(-1) = W in a Hilbert-Space, p A Polynomial
We consider the solution of (∗) XA + BX = C for bounded operators A, B, C and X on a Hilbert space, A normal. We establish the existence of a polynomial p and a bounded operator W with the property that the unique solution X of (∗) also solves X − p(−B)Xp(A)−1 = W uniquely. A known iterative algorithm can be applied to the latter equation to solve (∗).
متن کاملOn the solving matrix equations by using the spectral representation
The purpose of this paper is to solve two types of Lyapunov equations and quadratic matrix equations by using the spectral representation. We focus on solving Lyapunov equations $AX+XA^*=C$ and $AX+XA^{T}=-bb^{T}$ for $A, X in mathbb{C}^{n times n}$ and $b in mathbb{C} ^{n times s}$ with $s < n$, which $X$ is unknown matrix. Also, we suggest the new method for solving quadratic matri...
متن کاملA Tutorial on Co-induction and Functional Programming
Co-induction is an important tool for reasoning about unbounded structures. This tutorial explains the foundations of co-induction, and shows how it justiies intuitive arguments about lazy streams, of central importance to lazy functional programmers. We explain from rst principles a theory based on a new formulation of bisimilarity for functional programs, which coincides exactly with Morris-s...
متن کاملThe least-square bisymmetric solution to a quaternion matrix equation with applications
In this paper, we derive the necessary and sufficient conditions for the quaternion matrix equation XA=B to have the least-square bisymmetric solution and give the expression of such solution when the solvability conditions are met. Futhermore, we consider the maximal and minimal inertias of the least-square bisymmetric solution to this equation. As applications, we derive sufficient and necess...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007